DP. boolean d[i][j]: For the first i items, can we fill a backpack of size j? true or false ...

这道题在Best Time to Buy and Sell Stock III做过，那道题只是把k取了2而已 递推式依然是 local[i][j]=max(global[i-1][j ...